An algorithm for solving the absolute value equation
نویسندگان
چکیده
Presented is an algorithm which for each A, B ∈ Rn×n and b ∈ Rn in a finite number of steps either finds a solution of the equation Ax+B|x| = b, or states existence of a singular matrix S satisfying |S − A| ≤ |B| (and in most cases also constructs such an S).
منابع مشابه
A new Levenberg-Marquardt approach based on Conjugate gradient structure for solving absolute value equations
In this paper, we present a new approach for solving absolute value equation (AVE) whichuse Levenberg-Marquardt method with conjugate subgradient structure. In conjugate subgradientmethods the new direction obtain by combining steepest descent direction and the previous di-rection which may not lead to good numerical results. Therefore, we replace the steepest descentdir...
متن کاملAugmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems
One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...
متن کاملA uniform approximation method to solve absolute value equation
In this paper, we propose a parametric uniform approximation method to solve NP-hard absolute value equations. For this, we uniformly approximate absolute value in such a way that the nonsmooth absolute value equation can be formulated as a smooth nonlinear equation. By solving the parametric smooth nonlinear equation using Newton method, for a decreasing sequence of parameters, we can get the ...
متن کاملA hybrid algorithm for solving the absolute value equation
We propose a hybrid algorithm for solving the NP-hard absolute value equation (AVE): Ax−|x| = b, where A is an n×n square matrix. The algorithm makes no assumptions on the AVE other than solvability and consists of solving iteratively a linear system of equations followed by a linear program. The algorithm was tested on 100 consecutively generated random solvable instances of the AVE with n =50...
متن کاملAn efficient numerical method for singularly perturbed second order ordinary differential equation
In this paper an exponentially fitted finite difference method is presented for solving singularly perturbed two-point boundary value problems with the boundary layer. A fitting factor is introduced and the model equation is discretized by a finite difference scheme on an uniform mesh. Thomas algorithm is used to solve the tri-diagonal system. The stability of the algorithm is investigated. It ...
متن کاملImproved Harmony Search Algorithm with Chaos for Absolute Value Equation
In this paper, an improved harmony search with chaos (HSCH) is presented for solving NP-hard absolute value equation (AVE) Ax |x| = b, where A is an arbitrary square matrix whose singular values exceed one. The simulation results in solving some given AVE problems demonstrate that the HSCH algorithm is valid and outperforms the classical HS algorithm (HS) and HS algorithm with differential muta...
متن کامل